public class _1minSubArrayLen {
    //长度最小的子数组
    public int minSubArrayLen(int target, int[] nums) {
        int n = nums.length,sum = 0, len = Integer.MAX_VALUE;
        for(int left=0,right=0;right < n;right++){
            sum += nums[right];
            while(sum >= target){
                len = Math.min(len,right-left+1);
                sum -= nums[left];
                left++;
            }

        }
        return len == Integer.MAX_VALUE ? 0 : len;
    }
}
